منابع مشابه
2048 is (PSPACE) Hard, but Sometimes Easy
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player’s moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C0 is PSPACE-Complete. Our reduction is ...
متن کاملSometimes It’s Hard to Be Coherent
The paper provides an analysis of the construction in Hungarian known as focus raising, illustrated below. János-t mond-t-am hogy jön John-ACC say-PAST-1SG that come.3SG ‘It is John that I said is coming.’ In focus raising, the focus of the matrix clause is identified with a grammatical function in the embedded clause. Focus raising is particularly interesting because of the case marking on foc...
متن کاملEasy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Caring for the Ages
سال: 2016
ISSN: 1526-4114
DOI: 10.1016/j.carage.2016.05.008